A Deterministic Algorithm for Solving Imprecise Decision Problems
نویسندگان
چکیده
Today there are numerous tools for decision analysis, suitable both for human and artificial decision makers. Most of these tools require the decision maker to provide precise numerical estimates of probabilities and utilities. Furthermore, they lack the capability to handle inconsistency in the decision models, and will fail to deliver an answer unless the formulation of the decision problem is consistent. In this paper we present an algorithm for evaluating imprecise decision problems expressed using belief distributions, that also can handle inconsistency in the model. The same algorithm can be applied to decision models where probabilities and utilities are given as intervals or point values, which gives us a general method for evaluating inconsistent decision models with varying degree of expressiveness.
منابع مشابه
Relation Between Imprecise DESA and MOLP Methods
It is generally accepted that Data Envelopment Analysis (DEA) is a method for indicating efficiency. The DEA method has many applications in the field of calculating the relative efficiency of Decision Making Units (DMU) in explicit input-output environments. Regarding imprecise data, several definitions of efficiency can be found. The aim of our work is showing an equivalence relation between ...
متن کاملSolving an Aggregate Production Planning Problem by Fuzzy Based Genetic Algorithm (fbga) Approach
This paper work demonstrated an interactive Fuzzy Based Genetic Algorithm (FBGA) approach for solving a two products & two periods aggregate production planning (APP) with some vulnerable managerial constraints like imprecise demands, variable manufacturing costs etc. This proposed approach used the strategy of simultaneously minimizing the most possible value, the most pessimistic value & also...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملA reactive bone route algorithm for solving the traveling salesman problem
The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...
متن کاملGeometric Programming with Stochastic Parameter
Geometric programming is efficient tool for solving a variety of nonlinear optimizationproblems. Geometric programming is generalized for solving engineering design. However,Now Geometric programming is powerful tool for optimization problems where decisionvariables have exponential form.The geometric programming method has been applied with known parameters. However,the observed values of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000